De Bruijn index

Results: 29



#Item
11FreshML: A Fresh Approach to Name Binding in Metaprogramming Languages Final Report∗ Andrew M. Pitts February 2005 Abstract

FreshML: A Fresh Approach to Name Binding in Metaprogramming Languages Final Report∗ Andrew M. Pitts February 2005 Abstract

Add to Reading List

Source URL: www.cl.cam.ac.uk

Language: English - Date: 2005-02-28 05:08:39
12LFMTPNominal Reasoning Techniques in Coq (Extended Abstract) Brian Aydemir Aaron Bohannon Stephanie Weirich Department of Computer and Information Science

LFMTPNominal Reasoning Techniques in Coq (Extended Abstract) Brian Aydemir Aaron Bohannon Stephanie Weirich Department of Computer and Information Science

Add to Reading List

Source URL: www.seas.upenn.edu

Language: English - Date: 2014-07-10 05:49:28
13A Framework for Specifying, Prototyping, and Reasoning about Computational Systems (Doctoral Dissertation Proposal) Andrew Gacek Decemeber 3, 2007

A Framework for Specifying, Prototyping, and Reasoning about Computational Systems (Doctoral Dissertation Proposal) Andrew Gacek Decemeber 3, 2007

Add to Reading List

Source URL: www.dtc.umn.edu

Language: English - Date: 2012-08-16 12:29:03
14Abstract machines for higher-order term sharing Connor Lane Smith University of Kent [removed]  Abstract

Abstract machines for higher-order term sharing Connor Lane Smith University of Kent [removed] Abstract

Add to Reading List

Source URL: ifl2014.github.io

Language: English - Date: 2015-03-04 15:20:42
15Mechanized Verification of CPS Transformations Zaynah Dargaye and Xavier Leroy INRIA Paris-Rocquencourt B.P. 105, 78153 Le Chesnay, France [removed], [removed]

Mechanized Verification of CPS Transformations Zaynah Dargaye and Xavier Leroy INRIA Paris-Rocquencourt B.P. 105, 78153 Le Chesnay, France [removed], [removed]

Add to Reading List

Source URL: gallium.inria.fr

Language: English - Date: 2007-07-30 10:00:27
16Higher-Order and Symbolic Computation manuscript No. (will be inserted by the editor) A verified framework for higher-order uncurrying optimizations Zaynah Dargaye · Xavier Leroy

Higher-Order and Symbolic Computation manuscript No. (will be inserted by the editor) A verified framework for higher-order uncurrying optimizations Zaynah Dargaye · Xavier Leroy

Add to Reading List

Source URL: gallium.inria.fr

Language: English - Date: 2009-12-15 04:00:36
17Binders Unbound Stephanie Weirich Brent A. Yorgey  Tim Sheard

Binders Unbound Stephanie Weirich Brent A. Yorgey Tim Sheard

Add to Reading List

Source URL: www.seas.upenn.edu

Language: English - Date: 2014-07-10 05:47:09
18Term Indexing for the LEO-II Prover Frank Theiß1 Christoph Benzm¨ uller2 1 FR Informatik, Universit¨at des Saarlandes, Saarbr¨

Term Indexing for the LEO-II Prover Frank Theiß1 Christoph Benzm¨ uller2 1 FR Informatik, Universit¨at des Saarlandes, Saarbr¨

Add to Reading List

Source URL: www.boldsolutions.de

Language: English - Date: 2011-03-22 14:12:16
19Introduction to Lambda Calculus Henk Barendregt Erik Barendsen  Revised edition

Introduction to Lambda Calculus Henk Barendregt Erik Barendsen Revised edition

Add to Reading List

Source URL: ftp.cs.ru.nl

Language: English - Date: 2008-07-15 17:50:58
20Reasoning with Hypothetical Judgments and Open Terms in Hybrid Amy P. Felty Alberto Momigliano

Reasoning with Hypothetical Judgments and Open Terms in Hybrid Amy P. Felty Alberto Momigliano

Add to Reading List

Source URL: homepages.inf.ed.ac.uk

Language: English - Date: 2009-07-02 05:22:59